Preemptive type checking

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Preemptive Type Checking in Dynamically Typed Languages

We describe a type system that identifies potential type errors in dynamically typed languages like Python. The system uses a flow-sensitive static analysis on bytecodes to compute, for every variable and program point, overapproximations of the variable’s present and future use types. If the future use types are not subsumed by the present types, the further program execution may raise a type ...

متن کامل

Design and Evaluation of Preemptive Control Signature (PECOS) Checking

The paper presents the design and evaluation of PECOS, a PreEmptive COntrol Signature technique for on-line detection of control flow errors. The technique uses assertions that can be embedded in the assembly language code and that are triggered by control flow instructions in the code. The PECOS target error model is any corruption that causes the application to take an incorrect control flow ...

متن کامل

Type Checking Cryptography Implementations

Cryptographic software development is a challenging field: high performance must be achieved, while ensuring correctness and compliance with low-level security policies. CAO is a domain specific language designed to assist development of cryptographic software. An important feature of this language is the design of a novel type system introducing native types such as predefined sized vectors, m...

متن کامل

Type checking through unification

In this paper we describe how to leverage higher-order unification to type check a dependently typed language with meta-variables. The literature usually presents the unification algorithm as a standalone component, however the need to check definitional equality of terms while type checking gives rise to a tight interplay between type checking and unification. This interplay is a major source ...

متن کامل

Type checking and normalisation

This thesis is about Martin-Löf’s intuitionistic theory of types (type theory). Type theory is at the same time a formal system for mathematical proof and a dependently typed programming language. Dependent types are types which depend on data and therefore to type check dependently typed programming we need to perform computation (normalisation) in types. Implementations of type theory (usuall...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Logical and Algebraic Methods in Programming

سال: 2018

ISSN: 2352-2208

DOI: 10.1016/j.jlamp.2018.08.003